Yes, you’re right, of course. In my above comment, I failed to consider that not only Turing machines can be Goedelized, but also various infinite-step procedures that produce non-computable results, such as the one you outlined above.
(Also, I assume you meant “countably,” not “finitely” in the last sentence.)
Yes, you’re right, of course. In my above comment, I failed to consider that not only Turing machines can be Goedelized, but also various infinite-step procedures that produce non-computable results, such as the one you outlined above.
(Also, I assume you meant “countably,” not “finitely” in the last sentence.)